Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Online Appendix)
نویسندگان
چکیده
منابع مشابه
Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and the weighted sum of expected completion time objective. Our model allows for “unrelated” machines: the distributions of processing times may vary across both jobs and machines. We study static routing policies, which assign (or “route”) each job to a particul...
متن کاملApproximation Algorithms for Stochastic Optimization Problems in Operations Management
This article provides an introduction to approximation algorithms in stochastic optimization models arising in various application domains, including central areas of operations management, such as scheduling, facility location, vehicle routing problems, inventory and supply chain management and revenue management. Unfortunately, these models are very hard to solve to optimality both in theory ...
متن کاملApproximations to Stochastic Dynamic Programs via Information Relaxation Duality
In the analysis of complex stochastic dynamic programs (DPs), we often seek strong theoretical guarantees on the suboptimality of heuristic policies: a common technique for obtaining such guarantees is perfect information analysis. This approach provides bounds on the performance of an optimal policy by considering a decision maker who has access to the outcomes of all future uncertainties befo...
متن کاملOptimal Control of Stochastic Networks - an Approach via Fluid Models
We consider a general control problem for networks which includes the special cases of scheduling in multiclass queueing networks and routing problems. The fluid approximation of the network is used to derive new results about the optimal control for the stochastic network. The main emphasis lies on the average cost criterion, however the β-discounted as well as the finite cost problem are also...
متن کاملOnline Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit the number of offline optimizations which can be performed at decision time and/or in between decisions. It reviews our recent progress in this area, proposes some new algorithms, and reports some new experimental resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018